Robotic Motion and Path Planning Via Iterative Method Using Laplacian Technique

The paper deals with Robot motion and path planning programme. The aim of the paper is to develop a path planning programme for mobile robots that is based on laplacian technique using iterative method. One of the most difficult problems in robotics applications is developing robust autonomous motion planning. In order to build a truly autonomous robot, it must have the capability to efficiently and reliably plan a route from start to the goal point without colliding with obstacles in between. we present an algorithm for path planning to a target for mobile robot in unknown environment. The proposed algorithm allows a mobile robot to navigate through static obstacles, and finding the path in order to reach the target without collision. This algorithm provides the robot the possibility to move from the initial position to the final position (target). The field of robotics is closely related to AI. Intelligence is required for robots to be able to handle such tasks as object manipulation and navigation, with sub-problems of localization (knowing where you are, or finding out where other things are), mapping (learning what is around you, building a map of the environment), and motion planning (figuring out how to get there) or path planning (going from one point in space to another point, which may involve compliant motion – where the robot moves while maintaining physical contact with an object).